Planarity of a unit graph: Part -II $ |Max(R)| = 2 $ case
نویسندگان
چکیده
منابع مشابه
Planarity of Intersection Graph of submodules of a Module
Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...
متن کاملExcluded Minors for [ 2 , 3 ] - Graph Planarity
A Kuratowski-type approach for [2,3]-graphs, i.e. hypergraphs the cardinality of whose edges not more than 3, is presented, leading to a well-quasi-order in such a context, with a complete obstruction set of six forbidden hypergraphs to plane embedding. A Kuratowski-type result is presented for finite hypergraphs, the cardinality of whose edges is not more than 3. Motivation goes back to [1, 2]...
متن کاملOn the planarity of a graph related to the join of subgroups of a finite group
Let $G$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. We define an undirected simple graph $Delta(G)$ whose vertices are the proper subgroups of $G$, which are not contained in the Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge if and only if $G=langle H , Krangle$. In this paper we classify finite groups with planar graph. ...
متن کاملA Glance at Graph Theory—part Ii
This survey emphasises results in graph theory which were fairly difficult to prove. Because it is a personal view of the subject, this section will describe three of my own results which I personally found fairly difficult to prove (whatever their degree of difficulty in an absolute sense may be). A decomposition of a graph G is a set of subgraphs of G such that each edge of G belongs to exact...
متن کاملTesting Simultaneous Planarity When the Common Graph Is 2-Connected
Two planar graphs G1 and G2 sharing some vertices and edges are simultaneously planar if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the shared graph is 2-connected. Our algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0803/0075